An addition theorem modulo p
نویسندگان
چکیده
منابع مشابه
Algorithm for Modulo Addition KHALED
When designing elliptic-function filters there is usually some margin in performance to be distributed over the defining parameters. A recent paper offered some comparatively complicated formulas for use in this stage of the design. However, a simpler method, originally due to Darlington, is available and i s described briefly. passband ripple is again given by (2). ‘The cd function is the same...
متن کاملLinear Approximations of Addition Modulo
Addition modulo 2 − 1 is a basic arithmetic operation in the stream cipher ZUC. For evaluating ZUC’s resistance against linear cryptanalysis, it is necessary to study properties of linear approximations of the addition modulo 2 − 1. In this paper we discuss linear approximations of the addition of k inputs modulo 2n− 1 for n ≥ 2. As a result, an explicit expression of the correlations of linear...
متن کاملTheorem Proving modulo Associativity
We present an inference system for rst-order constrained clauses with equality modulo associativity (A). Our procedure is refutationally complete and reduces to Knuth-Bendix completion modulo A in the equational case. As an essential ingredient we present the rst |as far as we know| A-compatible reduction ordering total on the ground A-congruence classes.
متن کاملSparse Gaussian Elimination Modulo p: An Update
This paper considers elimination algorithms for sparse matrices over finite fields. We mostly focus on computing the rank, because it raises the same challenges as solving linear systems, while being slightly simpler. We developed a new sparse elimination algorithm inspired by the GilbertPeierls sparse LU factorization, which is well-known in the numerical computation community. We benchmarked ...
متن کاملLinear Approximations of Addition Modulo 2n
Addition modulo 2 − 1 is a basic arithmetic operation in the stream cipher ZUC. For evaluating ZUC in resistance to linear cryptanalysis, it is necessary to study properties of linear approximations of the addition modulo 2 − 1. In this paper we discuss linear approximations of the addition modulo 2 − 1 for integer n ≥ 2. As results, an exact formula on the correlations of linear approximations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1968
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(68)80027-4